Offensive Positioning Based on Maximum Weighted Bipartite Matching and Voronoi Diagram

نویسندگان

  • Mohammadhossein Malmir
  • Shahin Boluki
  • Saeed Shiry Ghidary
چکیده

In this paper we propose a modification to the well known Delaunay Triangulation based positioning in the attacking situation positioning of the agents in 2D Soccer Simulation environment. Due to advanced defensive skills such as marking skill, the attacker agents should have a dynamic positioning with respect to the rival team defenders. The proposed method employs the vertices of the Voronoi Diagram of the defending team agents as potential positions for the attacker team agents, since these positions are dynamic and change with the movement of the defending team agents and are always safe positions regarding the distance to the defending team agents, and also have a good coverage of the field. So the attacking agents can increase the chance of receiving pass by the ball owner agent and the scoring chance by taking positions on these vertices. This proposed method then applies Maximum Weighted Bipartite Matching to match these vertices to the attacking agents. This algorithm can be applied by each agent individually, but in order to reduce the possible decision conflicts in this matching which is the result of the limitation in the incoming information of the field from the agents’ sensors, this algorithm can be performed by one agent and then this agent should inform the other attacking team agents of the result by communication skills like ”say ability” in 2D Soccer Simulation (SS) environment. This method shows better performance in offensive situation than the conventional Delaunay Triangulation based positioning. It is tested in 2D SS environment as a highly dynamic multi-agent environment but its application is not restricted to the 2D SS League.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Stippling based on Weighted Centroidal Voronoi Diagrams

Stippling is an artistic technique that has been used profusely in antiquity. One of the main problems is that it requires great skill and patience to achieve excellent results due to the large number of points that must be drawn even for small formats. The use of computers, in general, and GPUs, in particular, with their computing capacity, has allowed to overcome many of these limits. We pres...

متن کامل

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs

The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic a...

متن کامل

Dynamic Weighted Voronoi Diagrams and Weighted Minimax Matching of Two Corresponding Point Sets

A weighted geometric fitting problem between two corresponding sets of points is to minimize the maximum weighted distance between two corresponding pairs of points by translating and rotating one set to the other set. For this weighted geometric fitting problem, dynamic weighted Voronoi diagrams have been applied to obtain an almost cubic algorithm. In this paper, we show a new reduction of th...

متن کامل

Research of localization algorithm based on weighted Voronoi diagrams for wireless sensor network

Wireless sensor network (WSN) is formed by a large number of cheap sensors, which are communicated by an ad hoc wireless network to collect information of sensed objects of a certain area. The acquired information is useful only when the locations of sensors and objects are known. Therefore, localization is one of the most important technologies of WSN. In this paper, weighted Voronoi diagram-b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014